Intersecting Systems of Signed Sets
نویسندگان
چکیده
منابع مشابه
Multiple cross-intersecting families of signed sets
A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ...,Ap are said to be cross-intersecting if any set in any family Ai intersects any set in any other family Aj . Hilton proved a sharp bound for the sum of sizes of cross-intersecting families of r-subsets of [n]. Our aim is to generalise Hilton's bound t...
متن کاملOn t-intersecting families of signed sets and permutations
A family A of sets is said to be t-intersecting if any two sets in A contain at least t common elements. A t-intersecting family is said to be trivial if there are at least t elements common to all its sets. Let X be an r-set {x1, ..., xr}. For k ≥ 2, we de ne SX,k and S∗ X,k to be the families of k-signed r-sets given by SX,k := {{(x1, a1), ..., (xr, ar)} : a1, ..., ar are elements of {1, ...,...
متن کاملSigned degree sets in signed bipartite graphs
A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...
متن کاملCross-Intersecting Sets of Vectors
Given a sequence of positive integers p = (p1, . . . , pn), let Sp denote the set of all sequences of positive integers x = (x1, . . . , xn) such that xi ≤ pi for all i. Two families of sequences (or vectors), A,B ⊆ Sp, are said to be r-cross-intersecting if no matter how we select x ∈ A and y ∈ B, there are at least r distinct indices i such that xi = yi. We show that for any pair of 1-cross-i...
متن کاملMultiply intersecting families of sets
Let [n] denote the set {1, 2, ..., n}, 2 the collection of all subsets of [n] and F ⊂ 2 be a family. The maximum of |F| is studied if any r subsets have an at least s-element intersection and there are no ` subsets containing t+1 common elements. We show that |F| ≤ Pt−s i=0 n−s i + t+`−s t+2−s n−s t+1−s + `− 2 and this bound is asymptotically the best possible as n →∞ and t ≥ 2s ≥ 2, r, ` ≥ 2 a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2007
ISSN: 1077-8926
DOI: 10.37236/959